Algebraic algorithms for LWE problems
نویسندگان
چکیده
منابع مشابه
Algebraic Algorithms for LWE
The Learning with Errors (LWE) problem, proposed by Regev in 2005, has become an ever-popular cryptographic primitive, due mainly to its simplicity, flexibility and convincing theoretical arguments regarding its hardness. Among the main proposed approaches to solving LWE instances — namely, lattice algorithms, combinatorial algorithms, and algebraic algorithms — the last is the one that has rec...
متن کاملQuantum algorithms for algebraic problems
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges ...
متن کاملOn Dynamic Algorithms for Algebraic Problems
In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, if f(x1, x2, ..., xn) = (y1, y2, ..., ym) is an algebraic problem, we consider answering on-line requests of the form ―change input xi to value v‘‘ or ―what is the value of output yj?‘‘ We first present lower bounds for some simply stated algebraic problems such as multipoint polynomial evaluat...
متن کاملAlgebraic Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several well-known combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our work yields new randomized algorithms that are the most efficient known. For non-bipartite matching, we obtain a simple, purely algebraic algorithm with running time O(n) where n is the number of vertices and ω is the m...
متن کاملBetter Algorithms for LWE and LWR
The Learning With Error problem (LWE) is becoming more and more used in cryptography, for instance, in the design of some fully homomorphic encryption schemes. It is thus of primordial importance to find the best algorithms that might solve this problem so that concrete parameters can be proposed. The BKW algorithm was proposed by Blum et al. as an algorithm to solve the Learning Parity with No...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2015
ISSN: 1932-2240
DOI: 10.1145/2815111.2815158